Cooperative Tasking for Deterministic Specification Automata

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperative Tasking for Deterministic Specification Automata

In our previous work [1], a divide-and-conquer approach was proposed for cooperative tasking among multi-agent systems. The basic idea is to decompose a requested global specification into subtasks for individual agents such that the fulfillment of these subtasks by each individual agent leads to the satisfaction of the global specification as a team. It was shown that not all tasks can be deco...

متن کامل

Multiple Vehicle Team Tasking for Cooperative Estimation

A methodology for cooperating multiple vehicles in a reconnaissance problem is proposed. A team of vehicles is used in surveying multiple targets potentially at different priority levels. The overall objective is to minimize the uncertainty on locations of targets using cooperative estimation in minimum time. Because the performance of the estimation highly depends on trajectories of observers,...

متن کامل

Deterministic Automata for Unordered Trees

Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in JSON or XML format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficien...

متن کامل

DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA

In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...

متن کامل

Fault-tolerant cooperative tasking for multi-agent systems

A natural way for cooperative tasking in multi-agent systems is through a top-down design by decomposing a global task into subtasks for each individual agent such that the accomplishments of these subtasks will guarantee the achievement of the global task. In our previous works [1], [2], we presented necessary and sufficient conditions on the decomposability of a global task automaton between ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Asian Journal of Control

سال: 2016

ISSN: 1561-8625

DOI: 10.1002/asjc.1300